#include "print.h"


void printVectStr(vector<string> &vecStr)
{
	cout <<" The input string: " << endl;
	for (size_t i = 0; i < vecStr.size(); i++)
	{
		cout << vecStr[i] << endl;
	}
}

void testForSubString()
{
	string s1 = "0", s2 = "1";
	cout <<" s1+s2: "<<s1 + s2 << endl;
	cout << s1[0]<< endl;
	cout << "s2+s1: " << s2 + s1 << endl;
	cout << s2[0] << endl;


}

/*
int main(int argc, char* argv[])
{



for (int i = 1; i < argc; i++){


cout << argv[i] << endl;

}

int A[] = { 1, 2, 3, 0, 0 };
int B[] = { 2, 4 };
//cout << << endl;
stack<int> st, st2;
st.push(1);
st.push(2);


vector<vector<int> > levelInt(0);
//stack<TreeNode*> stackTree;
//vector<int> intVec;
//intVec.push_back(1);
//levelInt.push_back(intVec);


TreeNode *p = new TreeNode(1);

TreeNode *left = new TreeNode(2);
TreeNode *right = new TreeNode(3);
TreeNode *left1 = new TreeNode(4);
TreeNode *right1 = new TreeNode(5);


p->left = left;
p->right = right;
p->left->left = left1;
p->left->right = NULL;
p->right->right = right1;
p->right->left = NULL;

Solution s;
//stackTree.push(p->left);
//stackTree.push(p->right);
//cout << " The longest path:" << s.maxDepth(p) << endl;

system("pause");
return 0;
}
*/